import java.util.Scanner;
import java.util.Stack;

public class Main {
    private static int x = 100;
    public static void main( String args[ ]){
        Main hs1 = new Main();hs1.x++;
        Main hs2 = new Main();hs2.x++;
        hs1=new Main();hs1.x++;
        Main.x--;
        System.out.println( "x="+x);
        System.out.println(Math.round(11.5));
    }











    public static void main1(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while (scanner.hasNext()){
            int n=scanner.nextInt();
            int prev=0;
            int cur=1;
            int sum=1;
            while (sum<n){
                sum=cur+prev;
                if(sum>n){
                    break;
                }
                prev=cur;
                cur=sum;
            }
            int count=0;
            while (cur!=n&&sum!=n){
                count++;
                cur++;
                sum--;
            }
            System.out.println(count);
        }
    }
    public boolean chkParenthesis(String A, int n) {
        boolean bool=false;
        Stack<Character> stack=new Stack<>();
        for(int i=0;i<n;i++){
            char ch=A.charAt(i);
            if(ch=='('){
                stack.add(ch);
            }else if(ch==')'){
                if(stack.isEmpty()){
                    return false;
                }
                stack.pop();
            }else{
                if(stack.isEmpty()){
                    return false;
                }
            }
        }
        return stack.isEmpty();
    }
}
